Monadic L-fuzzy Quantifiers of the Type <1n,1>
نویسنده
چکیده
The aim of this paper is to introduce monadic L-fuzzy quantifiers of the type 〈1, 1〉 and to investigate some of their semantic properties that are well-known in the generalized quantifier theory. Further, some relations between the semantic properties of generalized quantifiers are also studied for monadic L-fuzzy quantifiers. Finally, a property “to be extensional w.r.t. a given L-permutation equivalence” is proposed.
منابع مشابه
Basic Properties of L-fuzzy Quantifiers of the Type <1> Determined by Fuzzy Measures
The aim of this paper is to study monadic L-fuzzy quantifiers of the type 〈1〉 determined by fuzzy measures. These fuzzy quantifiers are defined using a novel notion of ⊗-fuzzy integral. Several semantic properties of these L-fuzzy quantifiers are studied. Keywords— fuzzy integral, fuzzy logic, fuzzy measure, fuzzy quantifier, generalized quantifier
متن کاملThe Downward Transfer of Elementary Satisfiability of Partition Logics
The following operation has frequently occurred in mathematics and its applications: partition a set into several disjoint non-empty subsets, so that the elements in each partition subset are homogeneous or indistinguishable with respect to some given properties. H.-D.Ebbinghaus first (in 1991) distilled from this phenomenon, which is a monadic second order property in nature, a special kind of...
متن کاملOn residuated lattices with universal quantifiers
We consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $X$, $(X, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $X$. We also show that, for a strong residuated lattice $X$, $bigcap {P_{lambda} ,|,P_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...
متن کاملDefinability properties and the congruence closure
We introduce a natural class of quantifiers Th containing all monadic type quantifiers, all quantifiers for linear orders, quantifiers for isomorphism, Ramsey type quantifiers, and plenty more, showing that no sublogic of Lo~o,(Th) or countably compact regular sublogic of L~o,(Th), properly extending L,o,o, satisfies the uniform reduction property for quotients. As a consequence, none of these ...
متن کاملCOMBINING FUZZY QUANTIFIERS AND NEAT OPERATORS FOR SOFT COMPUTING
This paper will introduce a new method to obtain the order weightsof the Ordered Weighted Averaging (OWA) operator. We will first show therelation between fuzzy quantifiers and neat OWA operators and then offer anew combination of them. Fuzzy quantifiers are applied for soft computingin modeling the optimism degree of the decision maker. In using neat operators,the ordering of the inputs is not...
متن کامل